Implementing Regular Tree Expressions
نویسندگان
چکیده
Regular tree expressions are a natural formalism for describing the sets of tree-structured values that commonly arise in programs; thus, they are well-suited to applications in program analysis. We describe an implementation of regular tree expressions and our experience with that implementation in the context of the FL type system. A combination of algorithms, optimizations, and fast heuristics for computa-tionally diicult problems yields an implementation eecient enough for practical use.
منابع مشابه
Construction of Tree Automata from Regular Expressions
Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative proof to this fact that results in smaller tree automata. To this aim, we transfer Antimirov’s partial derivatives from regular word expressions to regular tree expressions. For an analysis of the size of the resulting automato...
متن کاملEfficient Processing of XPath Queries Using Indexes
A number of query languages have been proposed in recent times for processing queries on XML and semistructured data. All these query languages make use of regular path expressions to query XML data. To optimize the processing of query paths a number of indexing schemes have also been proposed recently. XPath provides the basis for processing queries on XML data in the form of regular path expr...
متن کاملEfficiently Evaluating Regular Path Expressions for the Labeled Tree
Semistructured data[4] and XML can be represented by the labeled tree. When we store the labeled tree in object oriented database, each node may be stored as an object. The query for the labeled tree is different from those of conventional databases. The main difference of the query is the regular path expression(RPE) which has regular expressions in their path expressions[1, 2]. For example, “...
متن کاملEffciently Evaluating Regular Path Expressions for the Labeled Tree
Semistructured data[4] and XML can be represented by the labeled tree. When we store the labeled tree in object oriented database, each node may be stored as an object. The query for the labeled tree is different from those of conventional databases. The main difference of the query is the regular path expression(RPE) which has regular expressions in their path expressions[1, 2]. For example, ...
متن کاملTreeRegex: An Extension to Regular Expressions for Matching and Manipulating Tree-Structured Text (Technical Report)
Tree-structured text is ubiquitous in software engineering and programming tasks. However, despite its prevalence, users frequently write custom, specialized routines to query and update such text. For example, a user might wish to rapidly prototype a compiler for a domain-specific language by issuing successive transformations, or they might wish to identify all the call sites of a particular ...
متن کامل